Optimal self-avoiding paths in dilute random medium
نویسندگان
چکیده
منابع مشابه
A pr 1 99 5 Optimal self - avoiding paths in dilute random medium
By a new type of finite size scaling analysis on the square lattice, and by renormalization group calculations on hierarchical lattices we investigate the effects of dilution on optimal undirected self-avoiding paths in a random environment. The behaviour of the optimal paths remains the same as for directed paths in undiluted medium, as long as forbidden bonds are not exceeding the percolation...
متن کاملSelf Avoiding Random Surfaces
Self avoiding random surfaces on a cubic lattice are studied by extensive Monte Carlo sampling The surfaces have empty boundary and the topology of a sphere An oct tree data structure allows to obtain good statistics for surfaces whose plaquette number is almost an order of magnitude greater than in previous investigations Maximum likelihood determinations of the critical plaquette fugacity and...
متن کاملPolymers with self-avoiding interaction in random medium: a localization-delocalization transition
In this paper we investigate the problem of a long self-avoiding polymer chain immersed in a random medium. We find that in the limit of a very long chain and when the self-avoiding interaction is weak, the conformation of the chain consists of many “blobs” with connecting segments. The blobs are sections of the molecule curled up in regions of low potential in the case of a Gaussian distribute...
متن کاملMulti-level pinning problems for random walks and self-avoiding lattice paths*
We consider a generalization of the classical pinning problem for integer-valued random walks conditioned to stay non-negative. More specifically, we take pinning potentials of the form ∑ j > 0 εjNj , where Nj is the number of visits to the state j and {εj} is a non-negative sequence. Partly motivated by similar problems for low-temperature contour models in statistical physics, we aim at findi...
متن کاملSelf Avoiding Paths Routing Algorithm in Scale-Free Networks
In this paper, we present a new routing algorithm called "the self avoiding paths routing algorithm." Its application to traffic flow in scale-free networks shows a great improvement over the so called "efficient routing" protocol while at the same time maintaining a relatively low average packet travel time. It has the advantage of minimizing path overlapping throughout the network in a self c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 1997
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.55.3859